A Proof of the Existenceof Level 1

نویسنده

  • Mark A. Hovey
چکیده

In Land2] Landweber provides two proofs of the existence of (level 2) elliptic cohomology. As Baker points out in Bak1], one of these proofs gives a level 1 elliptic cohomology theory as well. In this note we provide an alternative proof of the existence of level 1 elliptic co-homology. The idea here is to use Landweber's direct proof of the existence of level 2 elliptic cohomology, and use an integrality argument to deduce the existence of level 1 elliptic cohomology from that.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolation of the tabular functions with fuzzy input and fuzzy output

In this paper, rst a design is proposed for representing fuzzy polynomials withinput fuzzy and output fuzzy. Then, we sketch a constructive proof for existenceof such polynomial which can be fuzzy interpolation polynomial in a set given ofdiscrete points rather than a fuzzy function. Finally, to illustrate some numericalexamples are solved.

متن کامل

Investigation of the Efficacy of Damp-Proof Montmorillonite Nanoclay for Radon Reduction Strategies in Radon Prone Areas of Ramsar

Background: Ramsar, a northern city in Iran, lies on the coast of the Caspian Sea. This city has areas with some of the highest levels of natural radiation measured to date. The radon concentration in some areas of Ramsar is up to 3700 Bq m–3. On the other hand, due to high level of humidity, damp-proof barriers should be used in construction of new buildings in radon prone areas of this cit...

متن کامل

A new security proof for FMNV continuous non-malleable encoding scheme

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

متن کامل

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995